#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
int n,a[N];
queue<int> q;
signed main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;++i)
        q.push(a[i]);
    for(int i=1;i<=n;++i){
        if(a[i]>q.front())q.pop();
    }cout<<q.size()<<'\n';
    return 0;
}